1

Planar graphs with maximum degree are -edge-choosable—A short proof

Year:
2010
Language:
english
File:
PDF, 206 KB
english, 2010
3

Improper choosability of graphs and maximum average degree

Year:
2006
Language:
english
File:
PDF, 174 KB
english, 2006
4

Circular choosability

Year:
2009
Language:
english
File:
PDF, 313 KB
english, 2009
6

The Push Tree problem

Year:
2004
Language:
english
File:
PDF, 165 KB
english, 2004
7

Improper coloring of unit disk graphs

Year:
2009
Language:
english
File:
PDF, 240 KB
english, 2009
8

Finding an Oriented Hamiltonian Path in a Tournament

Year:
2000
Language:
english
File:
PDF, 153 KB
english, 2000
10

Oriented Hamiltonian Cycles in Tournaments

Year:
2000
Language:
english
File:
PDF, 379 KB
english, 2000
12

Good edge-labelling of graphs

Year:
2009
Language:
english
File:
PDF, 225 KB
english, 2009
13

Complexity of -total labelling

Year:
2009
Language:
english
File:
PDF, 1.25 MB
english, 2009
14

--labelling for planar graphs is NP-complete for

Year:
2010
Language:
english
File:
PDF, 463 KB
english, 2010
15

-Total labelling of graphs

Year:
2008
Language:
english
File:
PDF, 246 KB
english, 2008
16

Hoàng–Reed conjecture holds for tournaments

Year:
2008
Language:
english
File:
PDF, 135 KB
english, 2008
17

Grundy number and products of graphs

Year:
2010
Language:
english
File:
PDF, 358 KB
english, 2010
18

Corrigendum to “-total labelling of graphs” [Discrete Math. 308 (2008) 496–513]

Year:
2010
Language:
english
File:
PDF, 169 KB
english, 2010
20

List Colouring Squares of Planar Graphs

Year:
2007
Language:
english
File:
PDF, 210 KB
english, 2007
21

Spanning galaxies in digraphs

Year:
2009
Language:
english
File:
PDF, 197 KB
english, 2009
23

Finding a five bicolouring of a triangle-free subgraph of the triangular lattice

Year:
2002
Language:
english
File:
PDF, 80 KB
english, 2002
24

Trees with three leaves are (n + l)-unavoidable

Year:
2001
Language:
english
File:
PDF, 299 KB
english, 2001
25

Trees in tournaments

Year:
2000
Language:
english
File:
PDF, 350 KB
english, 2000
27

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

Year:
2011
Language:
english
File:
PDF, 492 KB
english, 2011
28

Exact Algorithms forL(2,1)-Labeling of Graphs

Year:
2011
Language:
english
File:
PDF, 850 KB
english, 2011
29

Finding an induced subdivision of a digraph

Year:
2011
Language:
english
File:
PDF, 164 KB
english, 2011
30

Channel assignment and multicolouring of the induced subgraphs of the triangular lattice

Year:
2001
Language:
english
File:
PDF, 133 KB
english, 2001
31

Trees in tournaments

Year:
2002
Language:
english
File:
PDF, 135 KB
english, 2002
33

On spanning galaxies in digraphs

Year:
2012
Language:
english
File:
PDF, 267 KB
english, 2012
34

Finding an induced subdivision of a digraph

Year:
2012
Language:
english
File:
PDF, 371 KB
english, 2012
35

5-Coloring Graphs with 4 Crossings

Year:
2011
Language:
english
File:
PDF, 479 KB
english, 2011
36

3-Facial Coloring of Plane Graphs

Year:
2008
Language:
english
File:
PDF, 245 KB
english, 2008
37

-coloring of tight graphs

Year:
2012
Language:
english
File:
PDF, 237 KB
english, 2012
38

Oriented trees in digraphs

Year:
2013
Language:
english
File:
PDF, 413 KB
english, 2013
39

The game Grundy number of graphs

Year:
2013
Language:
english
File:
PDF, 469 KB
english, 2013
40

On the Grundy andb-Chromatic Numbers of a Graph

Year:
2013
Language:
english
File:
PDF, 521 KB
english, 2013
45

Author's correction

Year:
1985
File:
PDF, 33 KB
1985
46

Griggs and Yeh's Conjecture and $L(p,1)$-labelings

Year:
2012
Language:
english
File:
PDF, 336 KB
english, 2012
47

Finding a subdivision of a digraph

Year:
2015
Language:
english
File:
PDF, 603 KB
english, 2015
50

WDM and Directed Star Arboricity

Year:
2010
Language:
english
File:
PDF, 369 KB
english, 2010